Code design using deterministic annealing
نویسندگان
چکیده
منابع مشابه
Predictive vector quantizer design using deterministic annealing
A new approach is proposed for predictive vector quantizer (PVQ) design, which is inherently probabilistic, and is based on ideas from information theory and analogies to statistical physics. The approach effectively resolves three longstanding fundamental shortcomings of standard PVQ design. The first complication is due to the PVQ prediction loop, which has a detrimental impact on the converg...
متن کاملRobustizing robust M-estimation using deterministic annealing
Robustizing Robust M-Estimation Using Deterministic Annealing S. Z. Li School of Electrical and Electronic Engineering Nanyang Technological University Singapore 639798 [email protected] ABSTRACT This paper presents a modi ed robust M-estimator referred to as annealing M-estimator (AM-estimator) to avoid problems with M-estimator. The AM-estimator combines the annealing technique into the...
متن کاملThe deterministic annealing approach for discriminative continuous HMM design
We propose a deterministic annealing (DA) algorithm to design classifiers based on continuous observation hidden Markov models. The algorithm belongs to the class of minimum classification error (MCE) techniques that are known to outperform maximum likelihood (ML) design. Most MCE methods smooth the piecewise constant classification error cost to facilitate the use of local descent optimization...
متن کاملReduced-Complexity Deterministic Annealing for Vector Quantizer Design
This paper presents a reduced-complexity deterministic annealing (DA) approach for vector quantizer (VQ) design by using soft information processing with simplified assignment measures. Low-complexity distributions are designed to mimic the Gibbs distribution, where the latter is the optimal distribution used in the standard DA method. These low-complexity distributions are simple enough to fac...
متن کاملModel clustering by deterministic annealing
Although training an ensemble of neural network solutions increases the amount of information obtained from a system, large ensembles may be hard to analyze. Since data clustering is a good method to summarize large bodies of data, we will show in this paper how to use clustering on instances of neural networks. We will describe an algorithm based on deterministic annealing, which is able to cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sadhana
سال: 1996
ISSN: 0256-2499,0973-7677
DOI: 10.1007/bf02781790